Parallel Algorithms and Architecture for Computation of Manipulator

In this paper parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n2), and the O(n 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs the class of NC and that the time and processors bounds are of O(log2n) and to O(n4), respectively. However, the fastest stable parallel algorithms achieve the computation time of O(n) and can be derived by parallellzation of the O(n 3) serial algorithms. Parallel computation of the O{n 3) algorithms requires the development of parallel algorithms for a set of fundamentally different problems, that Is, the Newton-Euler formulation, the computation of the inertia matrix, decomposition of the symmetric, positive definite matrix, and the solution of triangular systems. Parallel algorithms for this set of problems are developed which can be efficiently implemented on a unique architecture, a triangular array of n{n+1)/2 processors with a simple nearest-nelghbor interconnectlon. This architecture is particularly suitable for VLSI and WSI implementations. The developed parallel algorithm, compared to the best serial O(n) algorithm, achieves an asymptotic speedup of more than two orders-of-magnitude in the computation the forward dynamics.